// ml:run = $bin < input
#include <iostream>
#include <cstring>

int const maxn = 256;
short f[maxn][maxn][maxn];
int n, a, b;


void init()
{
    std::memset(f, -1, sizeof(f));
}

short dfs(int turn, int a, int b)
{
    if (turn == n) {
        return f[turn][a][b] = (a > b ? 1 : (a < b ? 0 : (turn & 1)));
    }
    if (f[turn][a][b] != -1) return f[turn][a][b];
    short ans = 0;
    for (int i = 0; i <= a; i++) {
        short tmp = 300;
        short t1 = 0;
        if (i) t1 = dfs(turn + 1, a - i, b) + 1;
        else t1 = dfs(turn + 1, a - i, b) + (turn & 1);

        if (i) tmp = std::min(tmp, t1);
        else tmp = std::min(tmp, t1);

        if (turn & 1)
            if (b >= i + 1)
                tmp = std::min(tmp, dfs(turn + 1, a, b - i - 1));
        if (!(turn & 1)) {
            if (b >= i)
                tmp = std::min(tmp, dfs(turn + 1, a, b - i));
        }
        ans = std::max(ans, tmp);
    }
    return f[turn][a][b] = ans;
}

int main()
{
    std::ios_base::sync_with_stdio(false);
    int T; std::cin >> T;
    while (T--) {
        std::cin >> n >> a >> b;
        init();
        int ans = dfs(1, a, b);
        std::cout << "Alice " << ans << " Bob " << n - ans << "\n";
    }
}

